Multidimensional range queries on hierarchical Voronoi overlays

Multidimensional Range Queries on Modern Hardware

Range queries over multidimensional data are an important part of database workloads in many applications. Their execution may be accelerated by using multidimensional index structures (MDIS), such as kd-trees or R-trees. As for most index structures, the usefulness of this approach depends on the selectivity of the queries, and common wisdom told that a simple scan beats MDIS for queries acces...

Nomad: Virtual Environments on P2P Voronoi Overlays

Nomad is a support for the development of distributed virtual environments(DVE) on P2P networks. In a DV E each avatar generally interacts with other ones in its area of interest, i.e. the DV E region surrounding its location. Nomad exploits a Voronoi partition of the DV E to define a highly dynamic P2P overlay that connects a peer with those controlling avatars in its area of interest. This pa...

Multidimensional Range Query Processing in Structured P2P Overlays

The Multi-Ring Content Addressable Network (RCAN) [1] is a dynamic distributed index structure for efficient management of large multidimensional data sets over peer-to-peer systems. RCAN propose a new self-organizing overlay topology that achieves logarithmic routing performance and effective load balancing while minimizing the maintenance overhead during nodes join and departure. In this pape...

Authenticating Aggregate Range Queries over Multidimensional Dataset

We are interested in the integrity of the query results from an outsourced database service provider. Alice passes a set D of d-dimensional points, together with some authentication tag T, to an untrusted service provider Bob. Later, Alice issues some query over D to Bob, and Bob should produce the query result and a proof based on D and T. Alice wants to verify the integrity of the query resul...

Hierarchical Prefix Cubes for Range-Sum Queries